Finite Fuzzy Description Logics and Crisp Representations
نویسندگان
چکیده
Fuzzy Description Logics (DLs) are a formalism for the representation of structured knowledge that is imprecise or vague by nature. In fuzzy DLs, restricting to a finite set of degrees of truth has proved to be useful, both for theoretical and practical reasons. In this paper, we propose finite fuzzy DLs as a generalization of existing approaches. We assume a finite totally ordered set of linguistic terms or labels, which is very useful in practice since expert knowledge is usually expressed using linguistic terms. Then, we consider fuzzy DLs based on any smooth t-norm defined over this set. Initially we focus on the finite fuzzy DL ALCH, studying some logical properties, and showing the decidability of the logic by presenting a reasoning preserving reduction to the classical case. Finally, we extend our logic in two directions: by considering non-smooth t-norms and by considering additional DL constructors.
منابع مشابه
Complexity Sources in Fuzzy Description Logic
In recent years many Fuzzy Description Logics (FDLs) based on infinite t-norms have been proved to be undecidable. On the other hand, several FDLs based on finite t-norms, not only have been proved to be decidable, but they have been proved to belong to the same complexity classes as the corresponding crisp DLs. In light of such results, a question that naturally arises is whether the finite-va...
متن کاملFinite Fuzzy Description Logics: A Crisp Representation for Finite Fuzzy ALCH
Fuzzy Description Logics (DLs) are a formalism for the representation of structured knowledge affected by imprecision or vagueness. In the setting of fuzzy DLs, restricting to a finite set of degrees of truth has proved to be useful. In this paper, we propose finite fuzzy DLs as a generalization of existing approaches. We assume a finite totally ordered set of linguistic terms or labels, which ...
متن کاملConsistency in Fuzzy Description Logics over Residuated De Morgan Lattices
Fuzzy description logics can be used to model vague knowledge in application domains. This paper analyses the consistency and satisfiability problems in the description logic SHI with semantics based on a complete residuated De Morgan lattice. The problems are undecidable in the general case, but can be decided by a tableau algorithm when restricted to finite lattices. For some sublogics of SHI...
متن کاملTractability of the Crisp Representations of Tractable Fuzzy Description Logics
An important line of research within the field of fuzzy DLs is the computation of an equivalent crisp representation of a fuzzy ontology. In this short paper, we discuss the relation between tractable fuzzy DLs and tractable crisp representations. This relation heavily depends on the family of fuzzy operators considered. Introduction. Despite the undisputed success of ontologies, classical onto...
متن کاملOn the Failure of the Finite Model Property in some Fuzzy Description Logics
Fuzzy Description Logics (DLs) are a family of logics which allow the representation of (and the reasoning with) structured knowledge affected by vagueness. Although most of the not very expressive crisp DLs, such as ALC, enjoy the Finite Model Property (FMP), this is not the case once we move into the fuzzy case. In this paper we show that if we allow arbitrary knowledge bases, then the fuzzy ...
متن کامل